Search results for "permutation groups"

showing 6 items of 6 documents

Magic informationally complete POVMs with permutations

2017

Eigenstates of permutation gates are either stabilizer states (for gates in the Pauli group) or magic states, thus allowing universal quantum computation [M. Planat and Rukhsan-Ul-Haq, Preprint 1701.06443]. We show in this paper that a subset of such magic states, when acting on the generalized Pauli group, define (asymmetric) informationally complete POVMs. Such IC-POVMs, investigated in dimensions $2$ to $12$, exhibit simple finite geometries in their projector products and, for dimensions $4$ and $8$ and $9$, relate to two-qubit, three-qubit and two-qutrit contextuality.

1003permutation groups159informationally complete povmsFOS: Physical sciences01 natural sciences157[SPI.MAT]Engineering Sciences [physics]/Materialslaw.inventionCombinatorics81P50 81P68 81P13 81P45 20B05Permutationlaw0103 physical sciences1009[SPI.NANO]Engineering Sciences [physics]/Micro and nanotechnologies/Microelectronics010306 general physicslcsh:ScienceEigenvalues and eigenvectorsQuantum computer[SPI.ACOU]Engineering Sciences [physics]/Acoustics [physics.class-ph]PhysicsQuantum Physics120Multidisciplinary010308 nuclear & particles physicsPhysicsMagic (programming)Q Science (General)16. Peace & justiceKochen–Specker theoremProjectorfinite geometryPauli groupquantum contextualitylcsh:QPreprintmagic statesQuantum Physics (quant-ph)Research Article
researchProduct

A class of imprimitive groups

2010

We classify imprimitive groups inducing the alternating group A4 on the set of blocks, with the inertia subgroup satisfying some very natural geometrical conditions which force the group to operate linearly.

Class (set theory)Algebra and Number Theorypermutation groups imprimitive groups sharply transitive groupsPermutation groupsGroup (mathematics)Applied Mathematicsmedia_common.quotation_subjectAlternating groupimprimitive groupsPermutation groupInertiaCombinatoricsPermutation groups; imprimitive groups; sharply transitive groupsSettore MAT/03 - GeometriaMathematicsmedia_commonsharply transitive groups
researchProduct

Divisible designs from semifield planes

2002

AbstractWe give a general method to construct divisible designs from semifield planes and we use this technique to construct some divisible designs. In particular, we give the case of twisted field plane as an example.

Discrete mathematicsAutomorphism groupGeneral methodDivisible designsField (mathematics)Division (mathematics)Permutation groupTranslation (geometry)Plane (Unicode)Theoretical Computer ScienceR-permutation groupsCombinatoricsDiscrete Mathematics and CombinatoricsAutomorphism groupsTranslation planesDivision algebrasSemifieldMathematicsDiscrete Mathematics
researchProduct

Improved constructions of mixed state quantum automata

2009

Quantum finite automata with mixed states are proved to be super-exponentially more concise rather than quantum finite automata with pure states. It was proved earlier by A. Ambainis and R. Freivalds that quantum finite automata with pure states can have an exponentially smaller number of states than deterministic finite automata recognizing the same language. There was an unpublished ''folk theorem'' proving that quantum finite automata with mixed states are no more super-exponentially more concise than deterministic finite automata. It was not known whether the super-exponential advantage of quantum automata is really achievable. We prove that there is an infinite sequence of distinct int…

Discrete mathematicsQuantum algorithmsNested wordPermutation groupsGeneral Computer Scienceω-automatonTheoretical Computer ScienceCombinatoricsDeterministic finite automatonDFA minimizationDeterministic automatonQuantum finite automataAutomata theoryNondeterministic finite automatonFinite automataComputer Science::Formal Languages and Automata TheoryMathematicsComputer Science(all)Theoretical Computer Science
researchProduct

Finitary Representations and Images of Transitive Finitary Permutation Groups

1999

Abstract We characterize the point stabilizers and kernels of finitary permutation representations of infinite transitive groups of finitary permutations. Moreover, the number of such representations is determined.

Discrete mathematicshomomorphic imagesMathematics::CombinatoricsAlgebra and Number Theorypermutation groupsfinitary groupsBit-reversal permutationGeneralized permutation matrixPermutation groupCyclic permutationCombinatoricsMathematics::LogicPermutationwreath productsWreath productMathematics::Category TheoryComputer Science::Logic in Computer ScienceFinitaryPermutation graphMathematicsJournal of Algebra
researchProduct

Algebraic (2, 2)-transformation groups

2009

This paper contains the more significant part of the article with the same title that will appear in the Volume 12 of Journal of Group Theory (2009). In this paper we determine all algebraic transformation groups $G$, defined over an algebraically closed field $\sf k$, which operate transitively, but not primitively, on a variety $\Omega$, provided the following conditions are fulfilled. We ask that the (non-effective) action of $G$ on the variety of blocks is sharply 2-transitive, as well as the action on a block $\Delta$ of the normalizer $G_\Delta$. Also we require sharp transitivity on pairs $(X,Y)$ of independent points of $\Omega$, i.e. points contained in different blocks.

Transitive relationAlgebra and Number TheoryNaturwissenschaftliche Fakultät -ohne weitere Spezifikation-14L30permutation groupsBlock (permutation group theory)-Group Theory (math.GR)Permutation groupCentralizer and normalizerAction (physics)CombinatoricsFOS: Mathematicsddc:510Variety (universal algebra)Algebraically closed fieldAlgebraic numberMathematics - Group TheoryMathematicsJournal of Group Theory
researchProduct